A Note for Parametric Complexity of #2SAT
نویسندگان
چکیده
We present some results about the parametric complexity for counting the number of truth assignments for two Conjunctive Forms (2CF’s), such problem is denoted as #2SAT. It is common to analyze the computational complexity for #2SAT regarding the number of variables or the number of clauses on the input formula F We consider here, the time complexity analysis for #2SAT based on a positive integer parameter k, where k represents the number of satisfy assignments of F . We establish that for some values of k, the question: Is #2SAT (F ) = k?, can be answered in polynomial time with respect to the size of the formula F .
منابع مشابه
Note on MAX 2SAT
In this note we present an approximation algorithm for MAX 2SAT that given a (1− ε) satisfiable instance finds an assignment of variables satisfying a 1−O( √ ε) fraction of all constraints. This result is optimal assuming the Unique Games Conjecture. The best previously known result, due to Zwick, was 1−O(ε1/3). We believe that the analysis of our algorithm is much simpler than the analysis of ...
متن کاملAverage-Case Analysis for the MAX-2SAT Problem
We propose a simple probability model for MAX-2SAT instances for discussing the average-case complexity of the MAX-2SAT problem. Our model is a “planted solution model”, where each instance is generated randomly from a target solution. We show that for a large range of parameters, the planted solution (more precisely, one of the planted solution pair) is the optimal solution for the generated i...
متن کاملAn Algorithm to Compute the Complexity of a Static Production Planning (RESEARCH NOTE)
Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملThe Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification
Analyzing genomic data for finding those gene variations which are responsible for hereditary diseases is one of the great challenges in modern bioinformatics. In many living beings (including the human), every gene is present in two copies, inherited from the two parents, the so-called haplotypes. In this paper, we propose a simple combinatorial model for classifying the set of haplotypes in a...
متن کامل